Welcome![Sign In][Sign Up]
Location:
Search - Java tree

Search list

[JSP/JavaTreeDemo7

Description: 树状菜单的使用实例,在该代码中,实现了一颗树状菜单,该菜单可以任意折叠它的节点。-tree menu use examples in the code, achieving a tree menu, The menu can be folded its arbitrary nodes.
Platform: | Size: 2048 | Author: wzjin | Hits:

[JSP/Javatree

Description: 这是数据结构中的描述二叉树的一个JAVA 程序。-This data structure is the description of a binary tree JAVA program.
Platform: | Size: 28672 | Author: liu | Hits:

[JSP/Javatree

Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡,是自己用与数据结构考试编写的 ,对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Platform: | Size: 2048 | Author: 记忆超 | Hits:

[AI-NN-PRtree

Description: 一个用Java编写的分形程序。分形(Fractal)理论是Mandelbrot于20世纪70年代提出的一门非线性学科,用于描述自然界中的非平衡非线性复杂系统的有序状态。利用分形算法可以画出千奇百怪的图象。Mandelbrot集和Julia集是分形集合中最基本的两个集合-Using Java to prepare a fractal process. Fractal (Fractal) theory is the Mandelbrot in the 20th century, 70s raised a non-linear science, used to describe the nature of the non-equilibrium nonlinear complex systems in an orderly state. Using fractal algorithm can draw strange image. Mandelbrot set and Julia fractal sets is the most basic collection of two collections
Platform: | Size: 1024 | Author: 王大朋 | Hits:

[JSP/Javatree

Description: 一个简单的能动态生成的树形菜单,可以用做模版-A simple tree can be dynamically generated menu can be used to make templates
Platform: | Size: 27648 | Author: liping | Hits:

[JSP/JavaHuffmanCompress-java

Description: 利用霍夫曼树实现文本压缩。如果是文本可以压缩到40%的大小,其他的不行。-Huffman tree to achieve the use of text compression. If the text can be compressed to 40 of the size, the other not.
Platform: | Size: 29696 | Author: 肖超伟 | Hits:

[JSP/JavaFileTree1

Description: java 树状 查看本地所有文件目录 源码,供初学者用QQ:853577678-java tree view of all the local file directory source for beginners to use QQ: 853577678
Platform: | Size: 3072 | Author: 王玉波 | Hits:

[JSP/Javamonkey-tree

Description: java 实现的动态树 java 实现的动态树-java to achieve the realization of dynamic tree java dynamic tree
Platform: | Size: 10240 | Author: xinyi | Hits:

[JSP/Javatree

Description: 数据库的程序驱动文件,很有用的一个文件,在java开发中是必不可少的一个文件-Database driven document, a very useful document, in the java development is essential to a file
Platform: | Size: 36864 | Author: | Hits:

[JSP/Javawindow-tree

Description: JAVA实现WINDOWS文件管理,以树形显示文件-JAVA realize WINDOWS file management in order to show the document tree
Platform: | Size: 7168 | Author: helongfei | Hits:

[TreeViewmytree

Description: 树型工具条的应用,实现了点击节点可以读取数据并在视图上画图的功能。-Tree toolbar application realize the click node can read the data and in view of the drawing functions.
Platform: | Size: 3840000 | Author: 魏无际 | Hits:

[JSP/Javachapter9

Description: 数据结构与算法分析中AVL Tree的JAVA详尽代码 请有需要的同学下载-Data Structures and Algorithm Analysis of the AVL Tree code JAVA details, please have the need for students to download
Platform: | Size: 8192 | Author: 朱元琦 | Hits:

[Data structsB+tree

Description: B+树算法,没有密码,供学习使用.质量高-B+ Tree algorithm, there is no password, for learning to use. High-quality
Platform: | Size: 16384 | Author: cqu2000 | Hits:

[3D GraphicHuffman

Description: 迄今为止见过的最方便的huffman编码,效率很高 一个外国人写的,很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set the value of each node to the number of times that its symbol appears in the data stream. 3) Create a Minimum-Heap of N nodes. 4) Add every node whose value is greater than zero to the heap. 5) Extract the best two nodes in the heap. 6) Create a parent node whose children are the two extracted nodes. 7) Add the parent node to the heap. 8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap). 9) Extract the last node in the heap. The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream. The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: | Size: 17408 | Author: 游弋人生 | Hits:

[JSP/JavaTreeTest

Description: tapestry json 实现从数据库读取数据生成树-tapestry json realize read data from a database spanning tree
Platform: | Size: 15567872 | Author: qq | Hits:

[JSP/Javajava

Description: JAVA写的文件浏览器 功能: 1、树形文件夹视图 2、文件与文件夹列表 3、图片文件和文本文件预览 4、菜单选项 5、扩展功能-Written in JAVA file browser functions: one, tree-like folder view 2, the list of documents and 3 folders, pictures, documents and text files preview 4, menu option 5, the expansion of functions
Platform: | Size: 97280 | Author: kingbirdji | Hits:

[JSP/Javajavascript-tree

Description: 使用javascript封装的动态树,还没有实现点父类,子类全部选上的功能-Packaging use of javascript dynamic tree, has not yet been achieved at the parent category, sub-class all the functions of elected
Platform: | Size: 165888 | Author: yaoxj | Hits:

[JSP/JavaRplus-java

Description: 关于R+树的java源码,有兴趣的朋友可以研究下了-On the R+ Tree java source code, are interested can study a Friend
Platform: | Size: 19456 | Author: 董广宇 | Hits:

[JSP/JavadssTree

Description: ID3决策树算法的JAVA实现:ID3算法是机器学习中的一种分类方法,本例子用java构建多叉树来实现id3算法。-ID3 Decision Tree Algorithm JAVA realize: ID3 machine learning algorithm is a classification method, the example of using java to build a multi-tree algorithm id3 realize.
Platform: | Size: 460800 | Author: more | Hits:

[GUI Developcom

Description: tree结构,树形结构的实现,包括权限的设置-tree structure, tree structure realization, including permissions settings
Platform: | Size: 15360 | Author: 王亮 | Hits:
« 1 2 34 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net